The Impact of Global Clustering on Spatial Database Systems

Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In this paper, we propose a simple approach to global clustering called cluster organization. We will demonstrate that this cluster organization leads to considerable performance improvements without any algorithmic overhead. Based on real geographic data, we perform a detailed empirical performance evaluation and compare the cluster organization to other organization models not using global clustering. We will show that global clustering speeds up the processing of window queries as well as spatial joins without decreasing the performance of the insertion of new objects and of selective queries such as point queries. The spatial join is sped up by a factor of about 4, whereas non-selective window queries are accelerated by even higher speed up factors

The combination of spatial access methods and computational geometry in geographic database systems

Geographic database systems, known as geographic information systems (GISs) particularly among non-computer scientists, are one of the most important applications of the very active research area named spatial database systems. Consequently following the database approach, a GIS hag to be seamless, i.e. store the complete area of interest (e.g. the whole world) in one database map. For exhibiting acceptable performance a seamless GIS hag to use spatial access methods. Due to the complexity of query and analysis operations on geographic objects, state-of-the-art computational geomeny concepts have to be used in implementing these operations. In this paper, we present GIS operations based on the compuational geomeny technique plane sweep. Specifically, we show how the two ingredients spatial access methods and computational geomeny concepts can be combined für improving the performance of GIS operations. The fruitfulness of this combination is based on the fact that spatial access methods efficiently provide the data at the time when computational geomeny algorithms need it für processing. Additionally, this combination avoids page faults and facilitates the parallelization of the algorithms.

Multi-Step Processing of Spatial Joins

Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended spatial objects in twodimensional data space. We present an approach for spatial join processing that is based on three steps. First, a spatial join is performed on the minimum bounding rectangles of the objects returning a set of candidates. Various approaches for accelerating this step of join processing have been examined at the last year’s conference [BKS 93a]. In this paper, we focus on the problem how to compute the answers from the set of candidates which is handled by the following two steps. First of all, sophisticated approximations are used to identify answers as well as to filter out false hits from the set of candidates. For this purpose, we investigate various types of conservative and progressive approximations. In the last step, the exact geometry of the remaining candidates has to be tested against the join predicate. The time required for computing spatial join predicates can essentially be reduced when objects are adequately organized in main memory. In our approach, objects are first decomposed into simple components which are exclusively organized by a main-memory resident spatial data structure. Overall, we present a complete approach of spatial join processing on complex spatial objects. The performance of the individual steps of our approach is evaluated with data sets from real cartographic applications. The results show that our approach reduces the total execution time of the spatial join by factors

Multisensor Capacitance Probes for Simultaneously Monitoring Rice Field Soil-Water-Crop-Ambient Conditions

Multisensor capacitance probes (MCPs) have traditionally been used for soil moisture monitoring and irrigation scheduling. This paper presents a new application of these probes, namely the simultaneous monitoring of ponded water level, soil moisture, and temperature profile, conditions which are particularly important for rice crops in temperate growing regions and for rice grown with prolonged periods of drying. WiFi-based loggers are used to concurrently collect the data from the MCPs and ultrasonic distance sensors (giving an independent reading of water depth). Models are fit to MCP water depth vs volumetric water content (VWC) characteristics from laboratory measurements, variability from probe-to-probe is assessed, and the methodology is verified using measurements from a rice field throughout a growing season. The root-mean-squared error of the water depth calculated from MCP VWC over the rice growing season was 6.6 mm. MCPs are used to simultaneously monitor ponded water depth, soil moisture content when ponded water is drained, and temperatures in root, water, crop and ambient zones. The insulation effect of ponded water against cold-temperature effects is demonstrated with low and high water levels. The developed approach offers advantages in gaining the full soil-plant-atmosphere continuum in a single robust sensor

Efficient Processing of Spatial Joins Using R-Trees

Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel hardware platform. The parallel system is equipped with a so-called shared virtual memory which is well-suited for the design and implementation of parallel spatial join algorithms. We start with an algorithm that consists of three phases: task creation, task assignment and parallel task execu-tion. In order to reduce CPU- and I/O-cost, the three phases are processed in a fashion that pre-serves spatial locality. Dynamic load balancing is achieved by splitting tasks into smaller ones and reassigning some of the smaller tasks to idle processors. In an experimental performance compar-ison, we identify the advantages and disadvantages of several variants of our algorithm. The most efficient one shows an almost optimal speed-up under the assumption that the number of disks is sufficiently large. Topics: spatial database systems, parallel database systems

The InflateSAR Campaign: Evaluating SAR Identification Capabilities of Distressed Refugee Boats

Most of the recent research in the field of marine target detection has been concentrating on ships with large metallic parts. The focus of this work is on much more challenging targets represented by small rubber inflatables. They are of importance, since in recent years they have largely been used by migrants to cross the Mediterranean Sea between Libya and Europe. The motivation of this research is to mitigate the ongoing humanitarian crisis at Europe’s southern borders. These boats, packed with up to 200 people, are in no way suitable to cross the Mediterranean Sea or any other big water body and are in distress from the moment of departure. The establishment of a satellite-based surveillance infrastructure could considerably support search and rescue missions in the Mediterranean Sea, reduce the number of such boats being missed and mitigate the ongoing death in the open ocean. In this work we describe and analyze data from the InflateSAR acquisition campaign, wherein we gathered multiple-platform SAR imagery of an original refugee inflatable. The test site for this campaign is a lake which provides background clutter that is more predictable. The analysis considered a sum of experiments, enabling investigations of a broad range of scene settings, such as the vessel’s orientation, superstructures and speed. We assess their impact on the detectability of the chosen target under different sensor parameters, such as polarimetry, resolution and incidence angle. Results show that TerraSAR-X Spotlight and Stripmap modes offer good capabilities to potentially detect those types of boats in distress. Low incidence angles and cross-polarization decrease the chance of a successful identification, whereas a fully occupied inflatable, orthogonally oriented to the line of sight, seems to be better visible than an empty one. The polarimetric analyses prove the vessel’s different polarimetric behavior in comparison with the water surface, especially when it comes to entropy. The analysis considered state-of-the-art methodologies with single polarization and dual polarization channels. Finally, different metrics are used to discuss whether and to which extent the results are applicable to other open ocean datasets. This paper does not introduce any vessel detection or classification algorithm from SAR images. Rather, its results aim at paving the way to the design and the development of a specially tailored detection algorithm for small rubber inflatables